package com.agile.leetcode.tree.banlacetree;

/**
 * @Author KD
 * @Date 2021/1/12 13:56
 */
public class BanlaceTree {
}
class Node{
    int data;
    Node next;
    Node right;

    public Node(int data) {
        this.data = data;
    }

    public int getData() {
        return data;
    }

    public void setData(int data) {
        this.data = data;
    }

    public Node getNext() {
        return next;
    }

    public void setNext(Node next) {
        this.next = next;
    }

    public Node getRight() {
        return right;
    }

    public void setRight(Node right) {
        this.right = right;
    }

    @Override
    public String toString() {
        return "Node{" +
                "data=" + data +
                ", next=" + next +
                ", right=" + right +
                '}';
    }
}
